Перевод: со всех языков на все языки

со всех языков на все языки

search interval

См. также в других словарях:

  • Interval-valued computation — is a special kind of theoretical models for computation. It is capable of working on “interval valued bytes”: special subsets of the unit interval. If such computers were realized, their computation power would be much greater than that of… …   Wikipedia

  • Interval tree — In computer science, an interval tree, also called a segment tree or segtree, is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is… …   Wikipedia

  • Search engine technology — Modern web search engines are complex software systems using the technology that has evolved over the years. The largest search engines such as Google and Yahoo! utilize tens or hundreds of thousands of computers to process billions of web pages… …   Wikipedia

  • Search data structure — In computer science, a search data structure is any data structure that allows the efficient retrieval of specific items from a set of items, such as a specific record from a database. The simplest, most general, and least efficient search… …   Wikipedia

  • Golden section search — The golden section search is a technique for finding the extremum (minimum or maximum) of a unimodal function by successively narrowing the range of values inside which the extremum is known to exist. The technique derives its name from the fact… …   Wikipedia

  • Index (search engine) — Search engine indexing collects, parses, and stores data to facilitate fast and accurate information retrieval. Index design incorporates interdisciplinary concepts from linguistics, cognitive psychology, mathematics, informatics, physics, and… …   Wikipedia

  • Interpolation search — is an algorithm for searching for a given key value in an indexed array that has been ordered by the values of the key. It parallels how humans search through a telephone book for a particular name, the key value by which the book s entries are… …   Wikipedia

  • Microsoft Academic Search — is a free academic search engine developed by Microsoft Research. It covers more than 27 million publications and over 16 million authors across a variety of domains with updates added each week. This large collection of data has also allowed… …   Wikipedia

  • All-interval tetrachord — An all interval tetrachord is a tetrachord from which any interval class can be extracted by means of various inversions. There are only two possible all interval tetrachords. In set theory notation, these are [0,1,4,6] and [0,1,3,7] . The… …   Wikipedia

  • Line search — In (unconstrained) optimization, the line search strategy is one of two basic iterative approaches to finding a local minimum mathbf{x}^* of an objective function f:mathbb R^n omathbb R. The other method is that of trust regions.… …   Wikipedia

  • Bounding interval hierarchy — A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd trees. Bounding interval hierarchies can be used in high performance (or real time) ray tracing and may be especially useful …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»